package 左哥算法.ch07图;

import java.util.ArrayList;
import java.util.List;

public class Node {
    public Integer val;
    int in; //入度：进入该点的个数
    int out;    //出度：该点走出的个数
    List<Node> nexts;    //该点的邻居
    List<Edge> edges;

    public Node(Integer val) {
        this.val = val;
        nexts=new ArrayList<>();
        edges=new ArrayList<>();
    }

    @Override
    public String toString() {
        return " "+val+" ";
    }
}
